A sufficient condition for certain semigroups to be free

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Sufficient Condition for a Digraph to Be Hamiltonian

In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...

متن کامل

On sufficient condition to be in a certain subclass of starlike functions defined by subordination

An interesting criterion was given by Tuneski [N. Tuneski, On the quotient of the representations of convexity and starlikeness, Math. Nachr. 248–249 (2003) 200–203] for the analytic functions to be in the class S 1⁄21þAz 1þBz and its subclasses, where 1 6 B < A 6 1. This result is an extension of an earlier result of Silverman [H. Silverman, Convex and starlike criteria, Int. Math. Math. Sci. ...

متن کامل

CERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS

The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk  

متن کامل

A sufficient condition for planar graphs to be 3-colorable

Planar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be 3-colorable. We conjecture that, moreover, each plane graph with neither 5-cycles nor intersecting 3-cycles is 3-colorable. In this conjecture, none of the two assumptions can be dropped because there exist planar 4-chromatic graphs without 5-cycles, as well as planar 4chromatic graphs without intersect...

متن کامل

A Sharp Sufficient Condition for Sparsity Pattern Recovery

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1982

ISSN: 0021-8693

DOI: 10.1016/0021-8693(82)90010-2